منابع مشابه
On Graceful Digraphs
In 1994, Du and Sun conjectured that, for any positive even n and any integer m, the digraph n. −→ Cm is graceful. In this paper we prove the conjecture. Also, in 1985, Bloom and Hsu mentioned that the question remains open for the non generalized graceful labelings. For example, the following question is currently unanswered: How many distinct graceful labelings does a designated graceful digr...
متن کاملOn d-graceful labelings
We introduce a generalization of the well known concept of a graceful labeling. Given a graph Γ with e = d · m edges, we call d-graceful labeling of Γ an injective function from(m + 1)}. In the case of d = 1 and of d = e we find the classical notion of a graceful labeling and of an odd graceful labeling, respectively. Also, we call d-graceful α-labeling of a bipartite graph Γ a d-graceful label...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولFurther Results on Graceful Digraphs
A digraph D with p vertices and q arcs is labeled by assigning a distinct integer value g(v) from {0, 1, ..., q} to each vertex v. The vertex values, in turn, induce a value g(u, v) on each arc (u, v) where g(u, v) = (g(v)− g(u))(mod q + 1). If the arc values are all distinct then the labeling is called a graceful labeling of a digraph. In this paper, we prove a general result on graceful digra...
متن کاملGraceful Signed Graphs on C k 3
In [4], we have proved the necessary condition for sigraphs on union of k copies cycles of length three with one vertex in common denoted by C 3 to be graceful and sufficiency part of the theorem was discussed in certain special cases when all rim edges are negative and form a maximum matching. In this paper, we discuss the sufficiency part of the theorem on gracefulness of sigraphs on C 3 part...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Eletrônica de Iniciação Científica em Computação
سال: 2020
ISSN: 1519-8219
DOI: 10.5753/reic.2020.1745